An Axiomatization of Arrays for Kleene Algebra with Tests
نویسنده
چکیده
The formal analysis of programs with arrays is a notoriously difficult problem due largely to aliasing considerations. In this paper we augment the rules of Kleene algebra with tests (KAT) with rules for the equational manipulation of arrays in the style of schematic KAT. These rules capture and make explicit the essence of subscript aliasing, where two array accesses can be to the same element. We prove the soundness of our rules, as well as illustrate their usefulness with several examples, including a complete proof of the correctness of heapsort.
منابع مشابه
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
We give a nitary axiomatization of the algebra of regular events involving only equations and equational implications Unlike Salo maa s axiomatizations the axiomatization given here is sound for all interpretations over Kleene algebras
متن کاملEquational Axioms of Test Algebra
We present a complete axiomatization of test algebra the two sorted algebraic variant of Propositional Dynamic Logic PDL The axiomatization consists of adding a nite number of equations to any axiomatization of Kleene algebra and algebraic translations of the Segerberg axioms for PDL Kleene algebras are not nitely axiomatizable so our result does not give us a nite axiomatization of test algebr...
متن کاملAn Axiomatization for the Terminal Cycle
Milner proposed an axiomatization for the Kleene star in basic process algebra in the presence of deadlock and empty process modulo bisimulation equivalence In this paper Milner s axioms are adapted to the terminal cycle x which executes x in nitely many times in a row and it is shown that this axiomatization is complete for the terminal cycle in basic process algebra with deadlock and empty pr...
متن کاملAxiomatizations for the Perpetual Loop in Process Algebra
Milner proposed an axiomatization for the Kleene star in basic process algebra, in the presence of deadlock and empty process, modulo bisimulation equivalence. In this paper, Milner’s axioms are adapted to no-exit iteration x, which executes x infinitely many times in a row, and it is shown that this axiomatization is complete for no-exit iteration in basic process algebra with deadlock and emp...
متن کاملA Free Construction of Kleene Algebras with Tests
In this paper we define Kleene algebra with tests in a slightly more general way than Kozen’s definition. Then we give an explicit construction of the free Kleene algebra with tests generated by a pair of sets. Moreover we show that our free Kleene algebra with tests is isomorphic to Kozen and Smith’s Kleene algebra with tests if their construction available, that is, a generator of the Boolean...
متن کامل